Biomedical Interaction Prediction with Adaptive Line Graph Contrastive Learning
نویسندگان
چکیده
Biomedical interaction prediction is essential for the exploration of relationships between biomedical entities. Predicted interactions can help researchers with drug discovery, disease treatment, and more. In recent years, graph neural networks have taken advantage their natural structure to achieve great progress in prediction. However, most them use node embedding instead directly using edge embedding, resulting information loss. Moreover, they predict links based on similarity correlation assumptions, which poor generalization. addition, do not consider difference topological negative positive sample links, limits performance. Therefore, this paper, we propose an adaptive line contrastive (ALGC) method convert into two kinds nodes. By adjusting number intra-class edges inter-class edges, augmented generated and, finally, views balanced by learning. Through experiments four public datasets, it proved that ALGC model outperforms state-of-the-art methods.
منابع مشابه
RNA-Protein Interaction Prediction with Graph Kernels Master Thesis
RNA-binding proteins (RBPs) are a class of proteins which are found in many living organisms, they regulate post-transcriptional gene expression and play important roles. But up to now, the binding preferences for most RBPs are not well characterized. It is believed that the RBPs recognize the RNA targets in a sequence-specific manner, but the structural context of the binding region also influ...
متن کاملAdaptive On - line Learning in
An adaptive on-line algorithm extending the learning of learning idea is proposed and theoretically motivated. Relying only on gradient ow information it can be applied to learning continuous functions or distributions, even when no explicit loss function is given and the Hessian is not available. Its eeciency is demonstrated for a non-stationary blind separation task of acoustic signals.
متن کاملOn Contrastive Divergence Learning
Maximum-likelihood (ML) learning of Markov random fields is challenging because it requires estimates of averages that have an exponential number of terms. Markov chain Monte Carlo methods typically take a long time to converge on unbiased estimates, but Hinton (2002) showed that if the Markov chain is only run for a few steps, the learning can still work well and it approximately minimizes a d...
متن کاملPreference Learning for Adaptive Interaction
This extended abstract describes ongoing work in the development of an intelligent assistant that interacts with its user in a personalized fashion, deciding whether, when and how to interact based on a user’s needs and preferences. I consider two types of users: people who work in an office environment and require assistance with managing their daily meeting and project schedule, and people wi...
متن کاملOnline learning with graph-structured feedback against adaptive adversaries
We derive upper and lower bounds for the policy regret of T -round online learning problems with graph-structured feedback, where the adversary is nonoblivious but assumed to have a bounded memory. We obtain upper bounds of Õ(T ) and Õ(T ) for strongly-observable and weakly-observable graphs, respectively, based on analyzing a variant of the Exp3 algorithm. When the adversary is allowed a bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11030732